New Parallel Sparse Direct Solvers for Multicore Architectures
نویسندگان
چکیده
منابع مشابه
New Parallel Sparse Direct Solvers for Multicore Architectures
At the heart of many computations in science and engineering lies the need to efficiently and accurately solve large sparse linear systems of equations. Direct methods are frequently the method of choice because of their robustness, accuracy and potential for use as black-box solvers. In the last few years, there have been many new developments, and a number of new modern parallel general-purpo...
متن کاملNew parallel sparse direct solvers for engineering applications
At the heart of many computations in engineering lies the need to efficiently and accurately solve large sparse linear systems of equations. Direct methods are frequently the method of choice because of their robustness, accuracy and their potential for use as black-box solvers. In the last few years, there have been many new developments and a number of new modern parallel general-purpose spar...
متن کاملDirect Solvers for Sparse Matrices
There is a vast variety of algorithms associated with each step. The review papers by Duff [16] (see also [15, Chapter 6]) and Heath et al. [27] can serve as excellent reference of various algorithms. Usually steps 1 and 2 involve only the graphs of the matrices, and hence only integer operations. Steps 3 and 4 involve floating-point operations. Step 3 is usually the most time-consuming part, w...
متن کاملRandomized Sparse Direct Solvers
We propose randomized direct solvers for large sparse linear systems, which integrate randomization into rank structured multifrontal methods. The use of randomization highly simplifies various essential steps in structured solutions, where fast operations on skinny matrix-vector products replace traditional complex ones on dense or structured matrices. The new methods thus significantly enhanc...
متن کاملIterative and Direct Sparse Solvers on Parallel Computers
Solving large sparse systems of linear equations is required for a wide range of numerical applications. This paper addresses the main issues raised during the parallelization of iterative and direct solvers for such systems in distributed memory multiprocessors. If no preconditioning is considered, iterative solvers are simple to parallelize, as the most time-consuming computational structures...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2013
ISSN: 1999-4893
DOI: 10.3390/a6040702